Solving chance constrained optimal control problems in aerospace via kernel density estimation
نویسندگان
چکیده
منابع مشابه
Solving chance-constrained combinatorial problems to optimality
The aim of this paper is to provide new efficient methods for solving general chance-constrained integer linear programs to optimality. Valid linear inequalities are given for these problems. They are proved to characterize properly the set of solutions. They are based on a specific scenario, whose definition impacts strongly on the quality of the linear relaxation built. A branch-and-cut algor...
متن کاملShape constrained kernel density estimation
In this paper, a method for estimating monotone, convex and log-concave densities is proposed. The estimation procedure consists of an unconstrained kernel estimator which is modified in a second step with respect to the desired shape constraint by using monotone rearrangements. It is shown that the resulting estimate is a density itself and shares the asymptotic properties of the unconstrained...
متن کاملSolving optimal control problems by PSO-SVM
The optimal control of problem is about finding a control law for a given system such that a certain optimality criterion is achieved. Methods of solving the optimal control problems are divided into direct methods and mediated methods (through other equations). In this paper, the PSO- SVM indirect method is used to solve a class of optimal control problems. In this paper, we try to determine t...
متن کاملConstrained Nonlinear Optimal Control via a Hybrid BA-SD
The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...
متن کاملOptimization Approaches for Solving Chance Constrained Stochastic Orienteering Problems
Orienteering problems (OPs) are typically used to model routing and trip planning problems. OP is a variant of the well known traveling salesman problem where the goal is to compute the highest reward path that includes a subset of nodes and has an overall travel time less than the specified deadline. Stochastic orienteering problems (SOPs) extend OPs to account for uncertain travel times and a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimal Control Applications and Methods
سال: 2018
ISSN: 0143-2087,1099-1514
DOI: 10.1002/oca.2445